PENENTUAN SATURATION NUMBER DARI GRAF BENZENOID
نویسندگان
چکیده
منابع مشابه
On the Clar Number of Benzenoid Graphs
A Clar set of a benzenoid graph B is a maximum set of independent alternating hexagons over all perfect matchings of B. The Clar number of B, denoted by Cl(B), is the number of hexagons in a Clar set for B. In this paper, we first prove some results on the independence number of subcubic trees to study the Clar number of catacondensed benzenoid graphs. As the main result of the paper we prove a...
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملInduced saturation number
In this paper, we discuss the induced saturation number. It is a nice generalization of the saturation number that will allow us to consider induced subgraphs. We define the induced saturation number, indsat(n,H), to be the fewest number of gray edges in a trigraph T such that H does not appear in any realization of T , but if a black or white edge of T is flipped to gray then there exists a re...
متن کاملOn benzenoid systems with a minimal number of inlets
Recent experimental methods have made it possible to synthesize very large benzenoid molecules, sometimes referred to as “graphenes”.1–3 These have found unprecedented applications as organic materials for electronic and optoelectronic devices.2,3 As large benzenoid systems have countless possible isomers,4–6 it is a task of theoretical chemistry to help indicate those species that may possess ...
متن کاملBenzenoid series having a constant number of isomers. 2. Topological characteristics of strictly pericondensed constant-isomer benzenoid series
für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Matematika UNAND
سال: 2016
ISSN: 2721-9410,2303-291X
DOI: 10.25077/jmu.5.1.41-46.2016